Separation of random number generation and resolvability
نویسندگان
چکیده
We consider the problem of determining when a given source can be used to approximate the output due to any input to a given channel. We provide achievability and converse results for a general source and channel. For the special case of a full-rank discrete memoryless channel we give a stronger converse result than we can give for a general channel.
منابع مشابه
Separation of Random Number Generation and Resolvability
We consider the problem of determining when a given source can be used to approximate the output due to any input to a given channel. We provide achievability and converse results for a general source and channel. For the special case of a full-rank discrete memoryless channel we give a stronger converse result than we can give for a general channel.
متن کاملVariable-Length Resolvability for General Sources and Channels
We introduce the problem of variable-length source resolvability, where a given target probability distribution is approximated by encoding a variable-length uniform random number, and the asymptotically minimum average length rate of the uniform random numbers, called the (variable-length) resolvability, is investigated. We first analyze the variable-length resolvability with the variational d...
متن کاملVariable-Length Resolvability for Mixed Sources and its Application to Variable-Length Source Coding
In the problem of variable-length δ-channel resolvability, the channel output is approximated by encoding a variable-length uniform random number under the constraint that the variational distance between the target and approximated distributions should be within a given constant δ asymptotically. In this paper, we assume that the given channel input is a mixed source whose components may be ge...
متن کاملDirect Numerical Simulation of the Wake Flow Behind a Cylinder Using Random Vortex Method in Medium to High Reynolds Numbers
Direct numerical simulation of turbulent flow behind a cylinder, wake flow, using the random vortex method for an incompressible fluid in two dimensions is presented. In the random vortex method, the primary variable is vorticity of the flow field. After generation on the cylinder wall, it is followed in two fractional time step in a Lagrangian system of coordinates, namely convection and diffu...
متن کاملChannel simulation by interval algorithm: A performance analysis of interval algorithm
This paper deals with the problem of simulating a discrete memoryless channel and proposes two algorithms for channel simulation by using the interval algorithm. The rst algorithm provides exact channel simulation and the number of fair random bits per input sample approaches the conditional resolvability of the channel with probability one. The second algorithm provides approximate channel sim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 46 شماره
صفحات -
تاریخ انتشار 2000